PENERAPAN SEQUENTIAL SEARCH UNTUK PENGELOLAAN DATA BARANG
نویسندگان
چکیده
Dalam bidang industri manufaktur, adanya teknologi 4.0 sangat membantu terutama dalam pengelolaan stock barang sebagai salah satu contohnya. Pengelolaan data pada suatu perusahaan adalah masalah yang crusial dan harus ditangani dengan seksama. Karena hal ini akan mempengaruhi siklus kelangsungan hidup tersebut. informatika permasalahan dapat diselesaikan teori informatika, khususnya metode searching. Pada penelitian penulis menerapkan searching, yaitu sequential search kemudian diimplementasikan untuk proses pencarian PD.XYZ. PD.yamh menjadi lokasi studi kasus bergerak di jasa otomotif. Metode komponen EditText barang. Pengujian dilakukan mengetahui performa dari search, melakukan percobaan memberikan input ke Edit Text. kata (frase) ada database jumlah 800 sampel data, diperoleh hasil kecepatan rata-rata sebesar 0,2 second.
منابع مشابه
The Development of Semantic Web to Search Student Final Study Collections (Work Practice and Final Project)
1. H. F. Gunawan, “Penerapan Web Semantik Untuk Aplikasi Pencarian Pada Repositori Koleksi Penelitian ,Studi Kasus : Program Studi Sistem Informasi Stmik Mikroskil Medan,” vol. 15, no. 1, pp. 51–60, 2014. 2. I. A. S. Wicaksono, N. Charibaldi, and H. Jayadianti, “Penerapan Teknologi Semantic Web untuk Menentukan Pilihan Jalur Bis Trans Jogja,” Semin. Nas. Inform. 2010 (semnasIF 2010), vol. 2010,...
متن کاملSequential Bayesian Search
Millions of people search daily for movies, music, and books on the Internet. Unfortunately, non-personalized exploration of items can result in an infeasible number of costly interaction steps. We study the problem of efficient, repeated interactive search. In this problem, the user is navigated to the items of interest through a series of options and our objective is to learn a better search ...
متن کاملDiscrete Sequential Search
Before the search it is impossible to predict how many looks will be necessary to locate the target. A policy is a plan of search that tells where the nth look will be made--should it be necessary. For any policy, if P ( k ) is the probabil i ty tha t the target is found on or before the kth look, C(]c) is the total cost of the first k looks, and C is the random total cost, then the expectation...
متن کاملSequential Bayesian Search Appendices
Assume that at the beginning of game t, the system's belief in the user's preference is P t. Then, the certainty-equivalet user preference during game t is π * t (i) = E π∼Pt [π(i)] ∀i ∈ I. Recall we define π * min = min i∈I π * (i), Lemma A-1 formalizes the result that if π * t is " close " to π * , then for any decision tree T , E i∼π * t [N (T, i)] is " close " to E i∼π * [N (T, i)]: Lemma A...
متن کاملExpert-mediated sequential search
This paper studies markets, such as Internet marketplaces for used cars or mortgages, in which consumers engage in sequential search. In particular, we consider the impact of information-brokers (experts) who can, for a fee, provide better information on true values of opportunities. We characterize the optimal search strategy given a price and the terms of service set by the expert, and show h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anti Virus
سال: 2021
ISSN: ['1978-5232', '2527-337X']
DOI: https://doi.org/10.35457/antivirus.v15i1.1385